Sufficient and Necessary Conditions for Semidefinite Representability of Convex Hulls and Sets

نویسندگان

  • J. William Helton
  • Jiawang Nie
چکیده

Abstract. A set S ⊆ R is called to be Semidefinite (SDP) representable if S equals the projection of a set in higher dimensional space which is describable by some Linear Matrix Inequality (LMI). Clearly, if S is SDP representable, then S must be convex and semialgebraic (it is describable by conjunctions and disjunctions of polynomial equalities or inequalities). This paper proves sufficient conditions and necessary conditions for SDP representability of convex sets and convex hulls by proposing a new approach to construct SDP representations. The contributions of this paper are: (i) For bounded SDP representable sets W1, · · · ,Wm, we give an explicit construction of an SDP representation for conv(∪ k=1Wk). This provides a technique for building global SDP representations from the local ones. (ii) For the SDP representability of a compact convex semialgebraic set S, we prove sufficient condition: the boundary ∂S is positively curved, and necessary condition: ∂S has nonnegative curvature at smooth points and on nondegenerate corners. This amounts to the strict versus nonstrict quasi-concavity of defining polynomials on those points on ∂S where they vanish. The gaps between them are ∂S having positive versus nonnegative curvature and smooth versus nonsmooth points. A sufficient condition bypassing the gaps is when some defining polynomials of S satisfy an algebraic condition called sos-concavity. (iii) For the SDP representability of the convex hull of a compact nonconvex semialgebraic set T , we find that the critical object is ∂cT , the maximum subset of ∂T contained in ∂conv(T ). We prove sufficient conditions for SDP representability: ∂cT is positively curved, and necessary conditions: ∂cT has nonnegative curvature at smooth points and on nondegenerate corners. The gaps between sufficient and necessary conditions are similar to case (ii). The positive definite Lagrange Hessian (PDLH) condition is also discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions

 We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...

متن کامل

Some properties of convex hulls of integer points contained in general convex sets

In this paper, we study properties of general closed convex sets that determine the closed-ness and polyhedrality of the convex hull of integer points contained in it. We first present necessary and sufficient conditions for the convex hull of integer points contained in a general convex set to be closed. This leads to useful results for special class of convex sets such as pointed cones, stric...

متن کامل

First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials

A set is called semidefinite representable or semidefinite programming (SDP) representable if it can be represented as the projection of a higher dimensional set which is represented by some Linear Matrix Inequality (LMI). This paper discuss the semidefinite representability conditions for convex sets of the form SD(f) = {x ∈ D : f(x) ≥ 0}. Here D = {x ∈ R n : g1(x) ≥ 0, · · · , gm(x) ≥ 0} is a...

متن کامل

Optimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions

In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...

متن کامل

An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function

In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM Journal on Optimization

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2009